Optimal regulation of flow networks with transient constraints
نویسندگان
چکیده
منابع مشابه
Optimal regulation of flow networks with transient constraints
This paper investigates the control of flow networks, where the control objective is to regulate the measured output (e.g storage levels) towards a desired value. We present a distributed controller that dynamically adjusts the inputs and flows, to achieve output regulation in the presence of unknown disturbances, while satisfying given input and flow constraints. Optimal coordination among the...
متن کاملOptimal Control with Fuzzy Chance Constraints
In this paper, a model of an optimal control problem with chance constraints is introduced. The parametersof the constraints are fuzzy, random or fuzzy random variables. Todefuzzify the constraints, we consider possibility levels. Bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...
متن کاملQuasi-Optimal Regulation of FlowNetworks with Input Constraints
In this work we consider a flow network for which the goal is to solve a practical optimal regulation problem in the presence of input saturation. Based on Lyapunov arguments we propose distributed controllers which guarantee global convergence to an arbitrarily small neighborhood of the desired optimal steady state while fulfilling the constraints. As a case study we apply our distributed cont...
متن کاملOptimal flow control in acyclic networks with uncontrollable routings and precedence constraints
This paper introduces a novel optimal flow control problem that seeks to convey a specified amount of fluid to each of the nodes of an acyclic digraph with a single source node, while minimizing the total amount of fluid inducted into the network. Two factors complicating the aforementioned task are (i) the presence of nodes with uncontrollable routing of the traversing flow and (ii) a set of p...
متن کاملDesigning Optimal Flow Networks∗
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing cost functions, a minimum cost network of this sort has a tree topology, and hence can be called a Minimum Gilbert Arborescence (MGA). We characteris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2019
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2019.02.046